منابع مشابه
Graph Mining: Laws and Generators
How does the Web look? How could we tell an “abnormal” social network from a “normal” one? These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks, to sociology, to biology, and many more. Indeed, any M : N relation in database terminology can be represented as a graph. Many of these questions boil down to...
متن کاملDelineating Homology Generators in Graph Pyramids
Computation of homology generators using a graph pyramid can significantly increase performance, compared to the classical methods. First results in 2D exist and show the advantages of the method. Generators are computed on the upper level of a graph pyramid. Toplevel graphs may contain self loops and multiple edges, as a side product of the contraction process. Using straight lines to draw the...
متن کاملIrregular Graph Pyramids and Representative Cocycles of Cohomology Generators
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space than does homology. It assigns ‘quantities’ to the chains used in homology to characterize holes of any...
متن کاملDirectly computing the generators of image homology using graph pyramids
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure, i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of ce...
متن کاملInvariant representative cocycles of cohomology generators using irregular graph pyramids
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space than does homology. It assigns ‘quantities’ to the chains used in homology to characterize holes of any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 2020
ISSN: 0360-0300,1557-7341
DOI: 10.1145/3379445